Browsing by Subject "Random and expander graphs"
Now showing items 1-1 of 1
-
Article
Meeting the deadline: On the complexity of fault-tolerant continuous gossip
(2011)In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...